Перевод: с английского на русский

с русского на английский

vertex matrix

См. также в других словарях:

  • Vertex model — A vertex model is a type of statistical mechanics model in which the Boltzmann weights are associated with a vertex in the model (representing an atom or particle). This contrasts with a nearest neighbour model, such as the Ising model, in which… …   Wikipedia

  • Vertex pipeline — The function of the vertex pipeline in any GPU is to take geometry data (usually supplied as vector points), work with it if needed with either fixed function processes (earlier DirectX), or a vertex shader program (later DirectX), and create all …   Wikipedia

  • Vertex function — In quantum electrodynamics, the vertex function describes the coupling between a photon and an electron beyond the leading order of perturbation theory. In particular, it is the one particle irreducible correlation function involving the fermion… …   Wikipedia

  • Vertex enumeration problem — In mathematics, the vertex enumeration problem for a polyhedron, a polyhedral cell complex, a hyperplane arrangement, or some other object of discrete geometry, is the problem of determination of the object s vertices given some formal… …   Wikipedia

  • Adjacency matrix — In mathematics and computer science, an adjacency matrix is a means of representing which vertices (or nodes) of a graph are adjacent to which other vertices. Another matrix representation for a graph is the incidence matrix. Specifically, the… …   Wikipedia

  • Incidence matrix — In mathematics, an incidence matrix is a matrix that shows the relationship between two classes of objects. If the first class is X and the second is Y, the matrix has one row for each element of X and one column for each element of Y. The entry… …   Wikipedia

  • Degree matrix — In the mathematical field of graph theory the degree matrix is a diagonal matrix which contains information about the degree of each vertex. It is used together with the adjacency matrix to construct the Laplacian matrix of a graph. Definition… …   Wikipedia

  • Biadjacency matrix — In mathematics and computer science, the biadjacency matrix of a finite bipartite graph G with n black vertices and m white vertices is an n times; m matrix where the entry a ij is the number of edges joining black vertex i and white vertex j .… …   Wikipedia

  • Seidel adjacency matrix — In mathematics, in graph theory, the Seidel adjacency matrix of a simple graph G (also called the Seidel matrix and the original name the (−1,1,0) adjacency matrix) is the symmetric matrix with a row and column for each vertex, having 0 on the… …   Wikipedia

  • Tutte matrix — In graph theory, the Tutte matrix A of a graph G = ( V , E ) is a matrix used to determine the existence of a perfect matching: that is, a set of edges which is incident with each vertex exactly once.If the set of vertices V has 2 n elements then …   Wikipedia

  • Tutte matrix — noun A matrix used to determine whether all of the edges of a graph can be traversed without visiting a vertex more than once …   Wiktionary

Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»